Normalization Properties of Symmetric Logical Calculi
نویسندگان
چکیده
Acknowledgements I express my gratitude to René David and Karim Nour for their precious help, valuable comments and guidance through my work. I also thank to Pál Dömösi for his support and that he made me possible to concentrate my attention on this thesis. Last but not least I am grateful to my parents for they have stood by me during my studies with perseverance and patience.
منابع مشابه
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types
This paper extends the dual calculus with inductive types and coinductive types. The paper first introduces a non-deterministic dual calculus with inductive and coinductive types. Besides the same duality of the original dual calculus, it has the duality of inductive and coinductive types, that is, the duality of terms and coterms for inductive and coinductive types, and the duality of their re...
متن کاملA Note On Logical PERs and ReducibilityLogical Relations
We prove a general theorem for establishing properties expressed by binary relations on typed ((rst-order)-terms, using a variant of the reducibility method and logical PERs. As an application, we prove simultaneously that-reduction in the simply-typed-calculus is strongly normalizing, and that the Church-Rosser property holds (and similarly for-reduction).
متن کاملA Framework for Defining Logical Frameworks ? dedicated to Gordon D . Plotkin , on the occasion of his 60 th birthday
In this paper, we introduce aGeneral Logical Framework, calledGLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of lambda abstraction where β-reductions fire provided the argument satisfies a logical predicate and may produce an n-ary substitution. The type system keeps tra...
متن کاملA Framework for Defining Logical Frameworks
In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks, based on dependent types, in the style of the well known Edinburgh Logical Framework LF. The framework GLF features a generalized form of lambda abstraction where β-reductions fire provided the argument satisfies a logical predicate and may produce an n-ary substitution. The type system keeps t...
متن کاملArithmetical proofs of strong normalization results for symmetric lambda calculi
We give arithmetical proofs of the strong normalization of two symmetric λ-calculi corresponding to classical logic. The first one is the λμμ̃-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen’s classical sequent calculus LK in order to have a symmetry on one side between “program” and “context” and on other side between “call-by-name” and “...
متن کامل